Enforcing Commutativity Using Operational Transformations
نویسندگان
چکیده
Commutativity of operations is the better way to provide a high degree of concurrency on shared data types. In this short paper, we present a technique to increase concurrency using operational transformations. This technique enforces commutativity even though the operations do not naturally commute. We report our experience on (i) automatically verifying the correctness of this transformation-based commutativity and (ii) developing new applications based on operational transformations.
منابع مشابه
A syntactic commutativity format for SOS
Considering operators defined using Structural Operational Semantics (SOS), commutativity axioms are intuitive properties that hold for many of them. Proving this intuition is usually a laborious task, requiring several pages of boring and standard proof. To save this effort, we propose a syntactic SOS format which guarantees commutativity for a set of composition operators.
متن کاملTowards Correctness of Program Transformations Through Unification and Critical Pair Computation
Correctness of program transformations in extended lambda calculi with a contextual semantics is usually based on reasoning about the operational semantics which is a rewrite semantics. A successful approach to proving correctness is the combination of a context lemma with the computation of overlaps between program transformations and the reduction rules, and then of so-called complete sets of...
متن کاملStructure-preserving color transformations using Laplacian commutativity
Mappings between color spaces are ubiquitous in image processing problems such as gamut mapping, decolorization, and image optimization for color-blind people. Simple color transformations often result in information loss and ambiguities (for example, when mapping from RGB to grayscale), and one wishes to find an image-specific transformation that would preserve as much as possible the structur...
متن کاملComputing Overlappings by Unification in the Deterministic Lambda Calculus LR with letrec, case, constructors, seq and variable chains
We investigate the possibilities to automatize correctness proofs of program transformations in an extended lambda calculus LR. The calculus is equipped with an operational semantics, a standardized form of evaluation and based on that a notion of contextual equivalence which is used to define when a program transformations is considered as correct. A successful approach to proving correctness ...
متن کاملA note on half-supersymmetric bound states in M-theory and type IIA
By using O(7, 7) transformations, to deform D6–branes, we obtain half-supersymmetric bound state solutions of type IIA supergravity, containing D6, D4, D2, D0, F1-branes and waves. We lift the solutions to M-theory which gives half-supersymmetric M-theory bound states, e.g. KK6–M5–M5–M5–M2–M2–M2–MW. We also take near horizon limits for the type IIA solutions, which gives supergravity duals of 7...
متن کامل